Max-min sum minimization transportation problem
نویسندگان
چکیده
منابع مشابه
Min, Max, and Sum
This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...
متن کاملAuditing Categorical SUM, MAX and MIN Queries
Auditing consists in logging answered queries and checking, each time that a new query is submitted, that no sensitive information is disclosed by combining responses to answered queries with the response to the current query. Such a method for controlling data disclosure naturally raises the following inference problem: Given a set Q of answered queries and a query q, is the information asked ...
متن کاملSum-Max Graph Partitioning Problem
This paper tackles the following problem: given a connected graph G = (V,E) with a weight function on its edges and an integer k ≤ |V |, find a partition of V into k clusters such that the sum (over all pairs of clusters) of the heaviest edges between the clusters is minimized. We first prove that this problem (and even the unweighted variant) cannot be approximated within a factor of O(n1− ) u...
متن کاملThe Min-max Edge q-Coloring Problem
In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a colo...
متن کاملOn the max min vertex cover Problem
We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP-hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an n approximation ratio, while showing that unless P = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2006
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-006-7387-9